#include <bits/stdc++.h>
const int MaxSize = 100;
using namespace std;

class CircularQueue
{
    int *arr;
    int front;
    int rear;
    int size;

public:
    // 环形队列初始化为rear 和 front 初始化为0
    CircularQueue(int n)
    {
        size = n;
        arr = new int[MaxSize];
        front = rear = 0;
    }
    ~CircularQueue()
    {
        delete[] arr;
    }
    
    void enqueue(int x)
    {
        if ((front == 0 && rear == size - 1) || (rear == (front - 1) % ()))
    }
}

int main()
{
    return 0;
}